Can we solve asynchronous byzantine consensus without cryptography?
نویسنده
چکیده
Lamport [1] presented lower bound results on the number of acceptors required as a function of the number of processes that can fail so that fast asynchronous consensus can be achieved in the byzantine setting for favourable runs. The lower bounds presented assume that processes can use public-key cryptography during the computation. We explore how the lower bound results change if the public-key cryptography is not used for the fast runs.
منابع مشابه
Asynchronous Byzantine Consensus: Complexity, Resilience and Authentication (Preliminary Version)
We present a consensus algorithm that tolerates Byzantine process failures and arbitrarily long periods of network asynchrony. Our algorithm is the first to match the general time-complexity lower bound of [14], for which we give a complete proof. When the necessary conditions for optimal communication latency are not met, our algorithm gracefully degrades and retains the time-complexity of pre...
متن کاملSolving Consensus in a Byzantine Environment Using an Unreliable Fault Detector
Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. We define the class 3S(Byz) of eventually strong Byzantine fault detectors and the class 3W(Byz) of eventually weak Byzantine fault detectors and show that any B...
متن کاملFast Asynchronous Consensus with Optimal Resilience
We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may fail. We consider three types of process failures: crash, omission, and Byzantine. For crash or omission failures, we solve consensus assuming private channels or a publickey infrastructure, respectively. For Byzantine failures,...
متن کاملByzantine Fault Detectors for Solving Consensus
Unreliable fault detectors can be defined in terms of completeness and accuracy properties and can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. First, we define and categorize Byzantine faults. We then define two new completeness propert...
متن کاملBrief Announcement: A Leader-free Byzantine Consensus Algorithm
We consider the consensus problem in a partially synchronous system with Byzantine faults. In a distributed system of n processes, where each process has an initial value, Byzantine consensus is the problem of agreeing on a common value, even though some of the processes may fail in arbitrary, even malicious, ways. It is shown in [11] that — in a synchronous system — 3t + 1 processes are needed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004